Another look at automated theorem-proving II
نویسنده
چکیده
I continue the discussion initiated in [22] of whether or not computer-assisted proofs are a promising approach to preventing errors in reductionist security arguments. I examine some recent papers that describe automated security proofs for hashed ElGamal encryption, Boneh-Franklin identity-based encryption, and OAEP.
منابع مشابه
Rewrite Rules and Simplification of Matrix Expressions
This paper concerns the automated simplification of expressions which involve non-commuting variables. The technology has been applied to the simplification of matrix and operator theory expressions which arise in engineering applications. The non-commutative variant of the Gröbner Basis Algorithm is used to generate rewrite rules. We will also look at the phenomenon of infinite bases and impli...
متن کاملRewrite Rules and Simpliication of Matrix Expressions
This paper concerns the automated simpliication of expressions which involve non-commuting variables. The technology has been applied to the simpliication of matrix and operator theory expressions which arise in engineering applications. The non-commutative variant of the Grr obner Basis Algorithm is used to generate rewrite rules. We will also look at the phenomenon of innnite bases and implic...
متن کاملEvaluating Daikon and its Applications
Daikon was created by Michael D. Ernst in 2000 as a tool for dynamically detecting program invariants. Since then, it has been applied to a variety of tasks, ranging from software design to theorem proving. In this paper, we take a closer look at the abilities and limitations of Daikon, and then evaluate its applications.
متن کاملSome Experiments Using Term Rewriting Techniques for Concurrency
Theorem proving using term rewriting has been thoroughly explored for equational speciications; we look at the use of term rewriting for proving theorems in the process algebras of concurrency and conduct two experiments in this area. We use the LP theorem prover for proofs about CSP, and the RRL term rewriting system for reasoning about LOTOS. The results of these experiments provide informati...
متن کاملIdentity in modal logic theorem proving
THINKER is an automated natural deduction first-order theorem proving program. This paper reports on how it was adapted so as to prove theorems in modal logic. The method employed is an "indirect semantic method", obtained by considering the semantic conditions involved in being a valid argument in these modal logics. The method is extended from propositional modal logic to predicate modal logi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Mathematical Cryptology
دوره 5 شماره
صفحات -
تاریخ انتشار 2011